Solution of Constrained Clustering Problems through Homotopy Tracking
نویسندگان
چکیده
منابع مشابه
Probability-one homotopy maps for tracking constrained clustering solutions
Modern machine learning problems typically have multiple criteria, but there is currently no systematic mathematical theory to guide the design of formulations and exploration of alternatives. Homotopy methods are a promising approach to characterize solution spaces by smoothly tracking solutions from one formulation (typically an “easy” problem) to another (typically a “hard” problem). New res...
متن کاملStudying Constrained Clustering Problems Using Homotopy Maps
Many algorithms for constrained clustering have been developed in the literature that aim to balance vector quantization requirements of cluster prototypes against the discrete satisfaction requirements of constraint (must-link or must-not-link) sets. Significant research has been devoted to designing new algorithms for constrained clustering and understanding when constraints help clustering. ...
متن کاملProbability-one Homotopy Maps for Constrained Clustering Problems
Many algorithms for constrained clustering have been developed in the literature that aim to balance vector quantization requirements of cluster prototypes against the discrete satisfaction requirements of constraint (must-link or cannot-link) sets. A significant amount of research has been devoted to designing new algorithms for constrained clustering and understanding when constraints help cl...
متن کاملNumerical Solution of the Controlled Harmonic Oscillator by Homotopy Perturbation Method
The controlled harmonic oscillator with retarded damping, is an important class of optimal control problems which has an important role in oscillating phenomena in nonlinear engineering systems. In this paper, to solve this problem, we presented an analytical method. This approach is based on the homotopy perturbation method. The solution procedure becomes easier, simpler and mor...
متن کاملPreconditioned Iterative Methods for Homotopy Curve Tracking
Homotopy algorithms are a class of methods for solving systems of nonlinear equations that are globally convergent with probability one. All homotopy algorithms are based on the construction of an appropriate homotopy map and then the tracking of a curve in the zero set of this homotopy map. The fundamental linear algebra step in these algorithms is the computation of the kernel of the homotopy...
متن کامل